Non-Hamiltonian 3-Regular Graphs with Arbitrary Girth
نویسندگان
چکیده
منابع مشابه
Non-Hamiltonian 3–Regular Graphs with Arbitrary Girth
It is well known that 3–regular graphs with arbitrarily large girth exist. Three constructions are given that use the former to produce non-Hamiltonian 3–regular graphs without reducing the girth, thereby proving that such graphs with arbitrarily large girth also exist. The resulting graphs can be 1–, 2– or 3–edge-connected depending on the construction chosen. From the constructions arise (nai...
متن کاملMaximally non-hamiltonian graphs of girth 7
We describe a sufficient condition for graphs used in a construction of Thomassen (which yields hypohamiltonian graphs) to produce maximally non-hamiltonian (MNH) graphs as well. Then we show that the Coxeter graph fulfils this sufficient condition, and thus applying the Thomassen’s construction to multiple copies of the Coxeter graph yields infinitely many MNH graphs with girth 7. So far, the ...
متن کاملRegular Graphs of given Girth
Graph theory is the study of mathematical structures called graphs. We define a graph as a pair (V,E), where V is a nonempty set, and E is a set of unordered pairs of elements of V . V is called the set of vertices of G, and E is the set of edges. Two vertices a and b are adjacent provided (a, b) ∈ E. If a pair of vertices is adjacent, the vertices are referred to as neighbors. We can represent...
متن کاملThe non-existence of certain regular graphs of girth 5
Letf‘(k, g) be the minimum number of vertices that a graph with valency k and girth g can have. The results of Hoffman and Singleton [3] included f(k. 5) > k* + 1 for all k. except k = 2, 3, 7, 57 (it is unknown if the statement is true for k = 57). Brown proved in [2] that f(k, 5) > k2 + 2 for all k with the above exceptions; this statement is contained in a far more general theorem that has r...
متن کاملHamiltonian strongly regular graphs
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected nonHamiltonian strongly regular graph on fewer than 99 vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Universal Journal of Applied Mathematics
سال: 2014
ISSN: 2331-6446,2331-6470
DOI: 10.13189/ujam.2014.020111